Finding slid pairs in trivium with MiniSat

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Slid Pairs in Salsa20 and Trivium

The stream ciphers Salsa20 and Trivium are two of the finalists of the eSTREAM project which are in the final portfolio of new promising stream ciphers. In this paper we show that initialization and key-stream generation of these ciphers is slidable, i.e. one can find distinct (Key, IV) pairs that produce identical (or closely related) key-streams. There are 2 and more then 2 such pairs in Sals...

متن کامل

MINISAT 2.2 and MINISAT++ 1.1

MINISAT is a SAT solver designed to be easy to use, understand, and modify while still being efficient. Originally inspired by ZCHAFF [10] and LIMMAT [1], MINISAT features the now commonplace two-literal watcher scheme for BCP, first-UIP conflict clause learning, and the VSIDS variable heuristic (see [5] for a detailed description). Additionally, it has support for incremental SAT solving, and ...

متن کامل

Parallelizing MiniSat

The Boolean satisfiability (SAT) problem asks whether the variables in a given Boolean formula can be assigned in such a way that the formula evaluates to true. Given a Boolean formula, a SAT solver tries to find a set of satisfying assignments or declares that the formula is unsatisfiable. In this project, we implemented a parallel SAT solver using the Cilk multithreaded programming language. ...

متن کامل

Slid Pairs in the Initialisation of the A5/1 Stream Cipher

A5/1 is a shift register based stream cipher which uses a majority clocking rule to update its registers. It is designed to provide privacy for the GSM system. In this paper, we analyse the initialisation process of A5/1. We demonstrate a sliding property of the A5/1 cipher, where every valid internal state is also a legitimate loaded state and multiple key-IV pairs produce phase shifted keystr...

متن کامل

Finding prime pairs with particular gaps

By a prime gap of size g, we mean that there are primes p and p + g such that the g − 1 numbers between p and p + g are all composite. It is widely believed that infinitely many prime gaps of size g exist for all even integers g. However, it had not previously been known whether a prime gap of size 1000 existed. The objective of this article was to be the first to find a prime gap of size 1000,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Science China Information Sciences

سال: 2012

ISSN: 1674-733X,1869-1919

DOI: 10.1007/s11432-012-4676-6